And Ciesielski : Efficient Bdd - Based Logic Decomposition

BDD Decomposition for Efficient Logic Synthesis

There are two major approaches to the synthesis of logic circuits. One is based on a predominantly algebraic factorization leading to AND/OR logic optimization. The other is based on classical Reed-Muller decompositionmethod and its related decision diagrams, which have been shown to be efficient for XOR-intensive arithmetic functions. Both approaches share the same characteristics: while one i...

Bdd-based Logic Optimization System

BDS : A BDD - Based Logic Optimization System

This paper describes a novel logic decomposition theory and a practical logic synthesis system, BDS. It is based on a new binary decision diagrams (BDD) decomposition technique which supports all types of decomposition structures, including AND, OR, XOR, and complex MUX, both algebraic and Boolean. As a result, the method is very efficient in synthesizing both AND/OR and XOR-intensive functions...

Advances in Functional Decomposition: Theory and Applications

Functional decomposition aims at finding efficient representations for Boolean functions. It is used in many applications, including multi-level logic synthesis, formal verification, and testing. This dissertation presents novel heuristic algorithms for functional decomposition. These algorithms take advantage of suitable representations of the Boolean functions in order to be efficient. The fi...

Cofactoring-Based Upper Bound Computation for Covering Problems

This paper introduces an efficient technique to compute a tight upper bound for the unate and binate covering problems. It is known that a covering problem can be solved by finding a shortest path on a BDD representing a satisfiability formula. Our technique is based on finding an approximation to the shortest path by identifying a path on a BDD composed of as many negative edges as possible. T...